Information Framework For Composite Packaged Software Synthesis - Levin(Correct)
representative for each morphological class) with non-zero Is. Similar problems (e.g.multiple choice
software storming (Jordan et al.1989)steps of iterative design for DSS (Sprague and Carlson, 1982)
DAs for leaf nodes of the system model. Phase 3 (iterative)Bottom-Up hierarchical selection and www.yosh.ac.il/research/mslevin/it1.ps
Effects of Desktop 3D World Design on User Navigation.. - David Modjeska..(Correct)
more or less directly on real-world phenomena, yet none of them explores in depth the potential of VR as
-the conceptual part of navigation -into 3 iterative stages: mental mapping, route planning, and
comparison with hypertext, could facilitate the iterative design process. The resulting prototype could www.informatik.umu.se/~jwworth/G306_modjeska.pdf
ASSAM: A Tool for Semi-Automatically Annotating Semantic .. - Heß, Johnston.. (2004)(Correct)
parts, are known. We also compared it against a non-ensemble setup, where the extrinsic features are
learning algorithms. First, we have developed an iterative relational classification algorithm for
elements in the WSDL. In Sec. 3 we describe the iterative relational classification algorithm that www.cs.ucd.ie/staff/nick/home/research/download/hess-iswc04.pdf
Formal Numerical Program Analysis - Farmer, Thayer (1994)(Correct)
(even-nn n) terminates without an error i n is an nonnegative machine integer. 2) odd-nn n) terminates
.9 6.3 Iterative Factorial Function .
Recursive Factorial Function 33 D The File for Iterative Factorial Function 36 E The File for Fibonacci imps.mcmaster.ca/wmfarmer/../doc/numerical-programs.ps
Iterative Optimal Control of Liquid Slosh in an Industrial.. - Grundelius (2000)(Correct)
well for small surface oscillation amplitudes. A nonlinear model is presented in 9]comparisons Iterative Optimal Control of Liquid Slosh in an
Abstract This paper presents an iterative approach to optimal control when modeling aldebaran.elo.utfsm.cl/datasheet/cdc/cdc00/PDF/AUTHOR/CD001668.PDF
Parallel Numerical Algorithms and Applications in Inverse Problems - Larsen (1997)(Correct)
to a lot of tedious machine-specic details often a non-trivial and very time-consuming task. For
& D. A. Patterson, Computer Architecture: A Quantitative Approach, 2. Ed.Morgan Kaufmann Publishers,
are discussed, with emphasis on the iterative regularization algorithms based on the Lanczos www.daimi.au.dk/~rmunk/progress.ps.gz
The Multilevel Library:Software Tools for Multiscale .. - Barinka, Barsch.. (1998)(Correct)
Multilevel Library can be used free for research and non-commercial purposes within the gnu-software
Urban. Wavelets in numerical analysis and their quantitative properties. In A. Le M'ehaut'e, C. Rabut,
. 29 3.4.3 Iterative Solvers . www.igpm.rwth-aachen.de/pub/urban/reports/libdoku.ps.Z
Impedance Matrix Compression (IMC) Using Iteratively.. - Baharav, Leviatan (1996)(Correct)(1 citation)
It is well known that wavelets can represent non-stationary signals with just a few terms. Namely,
Impedance Matrix Compression (IMC) Using Iteratively Selected Wavelet Basis for MFIE Formulations
be needed to represent the unknown quantity. An iterative procedure is suggested to determine these shaked.technion.ac.il/~zachi/Pubs/itermfie.ps
Parallel and Serial Concatenated Single Parity Check - Product Codes David(Correct)
practice, the parallel and serial concatenation of nonrecursive codes can still perform very well, for
and associated performance bounds. 2 3 Iterative Decoding of Concatenated Codes In order to
Decoding of Concatenated Codes In order to iteratively decode the SCC or PCC, it is necessary to www.ece.uvic.ca/~agullive/pccv6.pdf
Tracking Mammographic Structures over Time - Marti, Zwiggelaar, Rubin (2001)(Correct)
linear structures is performed using a multi-scale non-linear operator [7]Detected lines are processed
have been used such as chamfer matching [3]iterative closest point [2] and relaxation based www.bmva.ac.uk/bmvc/2001/papers/82/../../papers/72/accepted_72.pdf
Density Evolution and Power Profile Optimization for Iterative.. - Müller(Correct)
(for more than one user and when user codes are non-trivial)driven by the fact that BP proved to
Evolution and Power Profile Optimization for Iterative Multiuser Decoders Based on Individually
Japan tanaka@eei.metro-u.ac.jp Abstract Iterative multiuser joint decoding based on exact Belief userver.ftw.at/~mueller/papers/allerton02.ps.gz
Iterative Blind Image Restoration Using Local Constraints - May, Stathaki, Katsaggelos (1998)(Correct)
programming was used to perform the constrained non# linear minimisation in step 2. The maximum number Iterative Blind Image Restoration Using Local
are updated from the current image estimate. The iterative#bound algorithm shows an improvementover the ivpl.ece.nwu.edu/Publications/Conferences/1998/eusipco98b.pdf
Analysis and Performance of Iterative Source-Channel Decoding - Görtz (2000)(Correct)
indices, i.e. the time-based dependencies and the nonuniform probability distributions, form the "outer"
Sept. 2000 251 Analysis and Performance of Iterative Source-Channel Decoding Norbert Gortz Faculty
E-mail: norbert.goertz@ieee.org Abstract: A new iterative source-channel decoding technique is proposed, www.lnt.ei.tum.de/mitarbeiter/goertz/istc2000.pdf
Iterative Dutch Combinatorial Auctions - Biswas, Narahari (2003)(Correct)
into ask prices of individual items because of non linear pricing. The average ask price of each item Iterative Dutch Combinatorial Auctions Shantanu Biswas
and set covering formulations to suggest novel iterative Dutch auction algorithms for combinatorial lcm.csa.iisc.ernet.in/biswas/annals.pdf
Optimization of Bit Mappings for Iterative Source-Channel Decoding - Görtz (2003)(Correct)
Optimization of Bit Mappings for Iterative Source-Channel Decoding Norbert G ortz
and the inner explicit channel code. Thus, iterative source-channel decoding based on the turbo
optimization of the quantizer bit mappings for iterative decoding. The simulations show strong gains due www.lnt.ei.tum.de/mitarbeiter/goertz/istc2003_goertz.pdf
Motion Based Segmentation - Peleg, Rom (1990)(Correct)(12 citations)
of the algorithm to recover the camera mo- tion in a non static world is an important feature which is used
objects contribute to other motion components. An iterative method is described for segmenting image
motion-based segmentation, in conjunction with an iterative dusterlug process. This process converges from www.cs.huji.ac.il/~peleg/papers/icpr90-MotionBasedSegmentation.pdf
Adjoints of Hamiltonian systems and iterative learning control - Fujimoto, Sugie(Correct)
employed. Here let us recall Frechet derivative of nonlinear operators. Definition 2.1 Consider an
properties of physical systems rather than quantitative ones. 3.1 General framework Let us consider
Adjoints of Hamiltonian systems and iterative learning control Kenji Fujimoto and Toshiharu www.nd.edu/~mtns/./papers/19228_4.pdf
Scheduling Algorithms for Input-Queued Cell Switches - McKeown (1995)(Correct)(51 citations)
2.2.2 Non-Uniform Workload
a single chip. In Chapter 3 we present i-SLIP, an iterative algorithm that improves upon SLIP by
offered loads. We consider two implementable, iterative algorithms i-LQF and i-OCF which converge on a tiny-tera.stanford.edu/~nickm/papers/nickMcKeown_thesis.ps
Partitioned Dynamics - Baraff, Witkin (1997)(Correct)
to handle these interactions unilaterally, letting non-cloth objects exert forces on cloth, but not vice
Systems .4 2.3 Iterative Solution .
global constraintforce equations can be solved iteratively using standard matrix methods, given little www.ri.cmu.edu/pub_files/pub1/baraff_david_1997_1/baraff_david_1997_1.pdf